Monotonic Rewriting Automata with a Restart Operation
نویسندگان
چکیده
We introduce a hierarchy of monotonic rewriting automata with a restart operation and show that its deterministic version collapses in a sequence of characterizations of deterministic context-free languages. The nondeterministic version of it gives a proper hierarchy of classes of languages with the class of context-free languages on the top.
منابع مشابه
Deleting Automata with a Restart Operation and Marcus Grammars
We introduce normal deleting automata with a restart operation (norm-DRA) and contextual grammars with regular selection (CGR). Both norm-DRA and CGR allow to describe syntax of (natural) languages as reduction systems. Some previously studied classes of contextual languages can be expressed using both norm-DRA and CGR. We give a hierarchy of some subclasses of norm-DRA and show the correspondi...
متن کاملDeleting Automata with a Restart Operation
A special type of linear bounded automata, called deleting automata with a restart operation, are introduced, and their language recognition power is studied.
متن کاملOn the flora of asynchronous locally non-monotonic Boolean automata networks
Boolean automata networks (BANs) are a well established model for regulation systems such as neural networks or gene regulation networks. Studies on the asynchronous dynamics of BANs have mainly focused on monotonic networks, where fundamental questions on the links relating their static and dynamical properties have been raised and addressed. This paper explores analogous questions on non-mono...
متن کاملBi-rewriting, a Term Rewriting Technique for Monotonic Order Relations
We propose an extension of rewriting techniques to derive inclusion relations a ⊆ b between terms built from monotonic operators. Instead of using only a rewriting relation ⊆ −→ and rewriting a to b, we use another rewriting relation ⊇ −→ as well and seek a common expression c such that a ⊆ −→ ∗ c and b ⊇ −→ ∗ c. Each component of the bi-rewriting system 〈 ⊆ −→, ⊇ −→〉 is allowed to be a subset ...
متن کاملSmaran: A Congruence-Closure Based System for Equational Computations
p. 1 Redundancy Criteria for Constrained Completion p. 2 Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations p. 17 A Case Study of Completion Modulo Distributivity and Abelian Groups p. 32 A Semantic Approach to Order-Sorted Rewriting p. 47 Distributing Equational Theorem Proving p. 62 On the Correctness of a Distributed Memory Grobner Basis Algorithm p. 77 Improving Transfor...
متن کامل